MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
نویسندگان
چکیده
منابع مشابه
Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs
Centralised matching programs have been established in several countries to organise kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually the goal is to maximise the number of transpla...
متن کاملMaximum cycle packing in Eulerian graphs using local traces
For a graph G = (V,E) and a vertex v ∈ V , let T (v) be a local trace at v, i.e. T (v) is an Eulerian subgraph of G such that every walk W (v), with start vertex v can be extended to an Eulerian tour in T (v). We prove that every maximum edge-disjoint cycle packing Z∗ of G induces a maximum trace T (v) at v for every v ∈ V . Moreover, if G is Eulerian then sufficient conditions are given that g...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملMaximum Directed Cuts in Graphs with Degree Constraints
The Max Cut problem is an NP-hard problem and has been studied extensively. Alon et al. studied a directed version of the Max Cut problem and observed its connection to the Hall ratio of graphs. They proved, among others, that if an acyclic digraph has m edges and each vertex has indegree or outdegree at most 1, then it has a directed cut of size at least 2m/5. Lehel et al. extended this result...
متن کاملA polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs for kidney exchange optimization
The Cardinality Constrained Multi-cycle Problem (CCMcP) and the Cardinality Constrained Cycle and Chain Problem (CCCCP) are both combinatorial optimisation problems defined on directed graphs. They have attracted the attention of the combinatorial optimisation community due to the application in kidney exchange and barter exchange optimisation. Consider a digraph where each arc is associated wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2009
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830909000373